An Energy* Delay Efficient Multi-Hop Routing Scheme for Wireless Sensor Networks
نویسندگان
چکیده
Sensors have very scarce resources in terms of memory, energy and computational capacities. Wireless sensor network is composed of a large number of such sensor nodes densely deployed in inhospitable physical environments. Energy efficient information dissemination throughout such a network is still a challenge. Though dissemination of information with minimum energy consumption is a key concern in wireless sensor networks, it often introduces additional delay. In this work, we first propose an energy and delay efficient multi-hop routing scheme called C2E2S (Cluster and Chain based Energy*Delay Efficient Routing Scheme) for wireless sensor networks. This scheme is a combination of clusterbased and chain-based approaches and the way to form clusters and chains in this work is center-based approach. To reduce a large number of communication overheads due to this approach, we propose a modified-centerbased approach called passive-BS-based approach. Next, we propose (1) an energy and delay aware routing algorithm for sensors within each k-hop cluster, and (2) an Energy-efficient chain construction algorithm for cluster heads. To evaluate the appropriateness of our approach, we analyze the evaluated performance against existing protocols in terms of communication overhead, the number of communication rounds (network lifetime), total amount of energy dissipated in the system over time, network delay and Energy*Delay metric using SENSE simulator. The simulation results show that C2E2S consumes less energy, balances the energy and delay metrics, and extends the network lifetime as compared to other approaches. key words: sensor network, intra-cluster routing, inter-clusterheads routing, Energy*Delay, network lifetime
منابع مشابه
Improving Energy Consumption by Using Cluster Based Routing Algorithm in Wireless Sensor Networks
Multi-path is favorite alternative for sensor networks, as it provides an easy mechanism to distributetraffic, as well as considerate fault tolerance. In this paper, a new clustering based multi path routingprotocol namely ECRR (Energy efficient Cluster based Routing algorithm for improving Reliability) isproposed, which is a new routing algorithm and guarantees the achievement to required QoS ...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کاملEnergy Efficiency and Reliability in Underwater Wireless Sensor Networks Using Cuckoo Optimizer Algorithm
Energy efficiency and reliability are widely understood to be one of the dominant considerations for Underwater Wireless Sensor Networks (UWSNs). In this paper, in order to maintain energy efficiency and reliability in a UWSN, Cuckoo Optimization Algorithm (COA) is adopted that is a combination of three techniques of geo-routing, multi-path routing, and Duty-Cycle mechanism. In the proposed alg...
متن کاملMLCA: A Multi-Level Clustering Algorithm for Routing in Wireless Sensor Networks
Energy constraint is the biggest challenge in wireless sensor networks because the power supply of each sensor node is a battery that is not rechargeable or replaceable due to the applications of these networks. One of the successful methods for saving energy in these networks is clustering. It has caused that cluster-based routing algorithms are successful routing algorithm for these networks....
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- IEICE Transactions
دوره 89-D شماره
صفحات -
تاریخ انتشار 2006